Reverse mathematics

Results: 109



#Item
21Mathematical logic / Computability theory / Mathematics / Theoretical computer science / Proof theory / Logic in computer science / Theory of computation / Second-order arithmetic / Combinatory logic / Reverse mathematics / Computable function

Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2013-04-16 05:40:26
22Computability theory / Theory of computation / Computable number / Computable function / 01 class / Computation in the limit

ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-10-09 14:07:43
23Automated theorem proving / Logic programming / Logic in computer science / Boolean algebra / Model theory / Substitution / Boolean satisfiability problem / Interpretation / Relationships among probability distributions / Lifting theory

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-02-06 12:14:26
24Mathematics / Topology / Algebra / General topology / Noetherian ring / Countable set / Separable space / Well-quasi-ordering / Compact space / Base / Algebraic number field

REVERSE MATHEMATICS, WELL-QUASI-ORDERS, AND NOETHERIAN SPACES EMANUELE FRITTAION, MATT HENDTLASS, ALBERTO MARCONE, PAUL SHAFER, AND JEROEN VAN DER MEEREN Abstract. A quasi-order Q induces two natural quasi-orders on P(Q)

Add to Reading List

Source URL: www.math.tohoku.ac.jp

Language: English - Date: 2016-02-20 21:08:52
25Computability theory / Proof theory / Mathematical logic / Predicate logic / Logic in computer science / Primitive recursive functional / Reverse mathematics / Primitive recursive function / Primitive recursive arithmetic / First-order logic / Peano axioms / Ordinal analysis

On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 09:11:16
26Computability theory / Mathematical logic / Proof theory / Theory of computation / Logic in computer science / Computable function / Reverse mathematics / PA degree / Peano axioms

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-10-26 09:24:01
27Computability theory / Computable function / Computation in the limit / Second-order arithmetic / Compactness theorem / Reverse mathematics / 01 class / PA degree / Low / Algorithmically random sequence / Computable number

THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-02-08 07:56:59
28Computability theory / Mathematical logic / Mathematics / Theoretical computer science / Primitive recursive function / Primitive recursive arithmetic / ELEMENTARY / Reverse mathematics / Pairing function / Ackermann function / Sequence / Recursion

Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 09:11:59
29

Reverse Mathematics and Well-ordering Principles Michael Rathjen∗and Andreas Weiermann Department of Pure Mathematics, University of Leeds Leeds LS2 9JT, United Kingdom Vakgroep Zuivere Wiskunde en Computeralgebra, Ghe

Add to Reading List

Source URL: www1.maths.leeds.ac.uk

Language: English - Date: 2012-10-11 08:36:26
    30Computability theory / Proof theory / Mathematical logic / Logic / Reverse mathematics / Mathematics / Philosophy of mathematics

    Classical provability of uniform versions and intuitionistic provability Makoto Fujiwara∗ Mathematical Institute Tohoku University 6-3, Aramaki Aoba, Aoba-ku Sendai, Miyagi, Japan

    Add to Reading List

    Source URL: www.mathematik.tu-darmstadt.de

    Language: English - Date: 2013-08-17 07:52:06
    UPDATE